Перевод: с английского на русский

с русского на английский

recursive method

См. также в других словарях:

  • Recursive partitioning — is a statistical method for multivariable analysis.cite book |author=Breiman, Leo |title=Classification and Regression Trees |publisher=Chapman Hall/CRC |location=Boca Raton |year=1984 |pages= |isbn=0 412 04841 8 |oclc= |doi=] . Recursive… …   Wikipedia

  • Recursive Bayesian estimation — is a general probabilistic approach for estimating an unknown probability density function recursively over time using incoming measurements and a mathematical process model. Model The true state x is assumed to be an unobserved Markov process,… …   Wikipedia

  • Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… …   Wikipedia

  • Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… …   Wikipedia

  • Recursive indexing — When number (generally large number) is represented in a finite alphabet set, and itcannot be represented by just one member of the set, Recursive Indexing is used.Recursive Indexing itself is a method to write the successive differences of the… …   Wikipedia

  • Recursive XY-cut — The recursive X Y cut is a top down page segmentation technique that decomposes a document image recursively into a set of rectangular blocks.The algorithm works by projecting the document bitmap (i.e. summing up all the pixels in a line) to the… …   Wikipedia

  • Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …   Wikipedia

  • Combs method — The Combs method is a method of writing fuzzy logic rules described by William E. Combs in 1997. It is designed to prevent combinatorial explosion in fuzzy logic rules. The Combs method takes advantage of the logical equality . Contents 1… …   Wikipedia

  • Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… …   Wikipedia

  • Adaptive Simpson's method — Adaptive Simpson s method, also called adaptive Simpson s rule, is a method of numerical integration proposed by William M. McKeeman in 1962.William M. McKeeman: Algorithm 145: Adaptive numerical integration by Simpson s rule. Commun. ACM 5(12):… …   Wikipedia

  • Scientific method — …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»